Non-crossing partitions for arbitrary Coxeter groups
نویسندگان
چکیده
منابع مشابه
Non-crossing Partitions, Non-nesting Partitions and Coxeter Sortable Elements in Types a and B
First, we investigate a generalization of the area statistic on Dyck paths for all crystallographic reflection groups. In particular, we explore Dyck paths of type B together with an area statistic and a major index. Then, we construct bijections between non-nesting and reverse non-crossing partitions for types A and B. These bijections simultaneously send the area statistic and the major index...
متن کاملDecomposition Numbers for Finite Coxeter Groups and Generalised Non-crossing Partitions
Given a finite irreducible Coxeter group W , a positive integer d, and types T1, T2, . . . , Td (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions c = σ1σ2 · · ·σd of a Coxeter element c of W , such that σi is a Coxeter element in a subgroup of type Ti in W , i = 1, 2, . . . , d, and such that the factorisation is “minimal” in the sense that t...
متن کاملClusters, Noncrossing Partitions and the Coxeter Plane Nathan Reading
The present research is a contribution to W -Catalan combinatorics, which concerns generalizations of objects counted by the Catalan number to an arbitrary finite Coxeter group W. Triangulations of a polygon are a special case of the combinatorial clusters appearing in the theory of cluster algebras of finite type. Planar diagrams analogous to triangulations encode the combinatorics of clusters...
متن کاملGeneralized Non-Crossing Partitions and Buildings
For any finite Coxeter group W of rank n we show that the order complex of the lattice of non-crossing partitions NC(W ) embeds as a chamber subcomplex into a spherical building of type An−1. We use this to give a new proof of the fact that the non-crossing partition lattice in type An is supersolvable for all n. Moreover, we show that in case Bn, this is only the case if n < 4. We also obtain ...
متن کاملCyclic Sieving for Generalised Non–Crossing Partitions Associated to Complex Reflection Groups of Exceptional Type
We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively to Bessis and Reiner, for the 26 exceptional well-generated complex reflection groups. The computational details are provided in the manuscript “Cyclic sieving for generalised non-crossing partitions associated to co...
متن کامل